Discrete Mathematics - PDFSEARCH.IO - Document Search Engine

Discrete Mathematics
Results: 2210

#	Item
941	THE FACTORING DEAD: PREPARING FOR THE CRYPTOPOCALYPSE Javed Samuel — javed[at]isecpartners[dot]com iSEC Partners, Inc 123 Mission Street, Suite 1020 San Francisco, CA 94105 Add to Reading List Source URL: www.isecpartners.com Language: English - Date: 2014-04-02 07:42:28 Integer factorization algorithms Finite fields Logarithms Computational hardness assumptions Discrete logarithm Integer factorization Quadratic sieve XTR General number field sieve Abstract algebra Cryptography Mathematics
942	Discrete Differential Geometry: An Applied Introduction SIGGRAPH 2006 An Algorithm for the Construction of Intrinsic Delaunay Triangulations with Applications to Digital Geometry Processing Add to Reading List Source URL: graphics.stanford.edu Language: English - Date: 2014-02-06 18:24:28 Geometry Delaunay triangulation Line graph Neighbourhood Pitteway triangulation Point set triangulation Graph theory Triangulation Mathematics
943	A Formalization of Programs in First-Order Logic with a Discrete Linear Order∗ Fangzhen Lin () Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, H Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2014-03-07 00:56:20 Logic in computer science Functions and mappings Formal methods Function First-order logic Predicate transformer semantics FO Quasigroup Dynamic logic Mathematics Mathematical logic Logic
944	O P - S F N E T - Volume 20, Number 2 – March 15, 2013 Editors: Diego Dominici Martin Muldoon Add to Reading List Source URL: staff.fnwi.uva.nl Language: English - Date: 2013-03-18 04:46:38 Special functions Macdonald polynomials Richard Askey Askey scheme Tropical geometry Digital Library of Mathematical Functions Discrete orthogonal polynomials Orthogonal polynomials Mathematics Mathematical analysis
945	An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions Sunil Arya Hong Kong University of Science and Technology, Hong Kong, David M. Mount University of Maryland, College Park, Maryland, Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 05:02:45 Search algorithms Discrete geometry Data mining Information retrieval Nearest neighbor search K-d tree K-nearest neighbor algorithm Point location Voronoi diagram Information science Mathematics Geometry
946	Sampling and Meshing a Surface with Guaranteed Topology and Geometry∗ Siu-Wing Cheng† Tamal K. Dey‡ Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2005-03-14 07:05:29 Discrete geometry Voronoi diagram Mathematics Delaunay triangulation Symbol Support Differential geometry of surfaces Puppe sequence Measure theory Computational geometry Diagrams
947	MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Coded Modulation Design for Finite-Iteration Decoding and High-Dimensional Modulation Add to Reading List Source URL: www.merl.com Language: English - Date: 2015-04-17 10:54:33 Telecommunications engineering Information Discrete mathematics Low-density parity-check code Forward error correction EXIT chart Noisy-channel coding theorem Interleaving Decoder Error detection and correction Coding theory Information theory
948	Space-Efficient Approximate Voronoi Diagrams Sunil Arya Theocharis Malamatos∗ David M. Mount† Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:51:46 Discrete geometry Computational geometry Diagrams Voronoi diagram K-d tree Nearest neighbor search Quadtree Information science Mathematics Geometry
949	Maximum Coverage over a Matroid Constraint Yuval Filmus Justin Ward University of Toronto China Theory Week 2011 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-10-18 11:48:40 Discrete mathematics Matroid Submodular set function Greedy algorithm Greedoid Weighted matroid Matroid theory Mathematics Combinatorics
950	Approximate Nearest Neighbor Queries in Fixed Dimensions∗ Sunil Arya† David M. Mount‡ S and computing the distance to q. More efficient approaches are based on preprocessing the points S and creating a data structu Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:49:25 Search algorithms Discrete geometry Computational geometry Data mining Information retrieval Nearest neighbor search Proximity problems K-d tree Voronoi diagram Mathematics Information science Geometry

UPDATE